Worst-Case Analysis of Cash Inventory in Single Machine Scheduling

This paper studies the inventory of cash as a renewable resource in single machine scheduling problem. The status is incorporated to objective function. Average and minimum available maximum average deficiency are contemplated subject worst-case scenario that for each job cost [price] paid [received] entirely at start [end] processing job. For objective, either proof NP-Hardness or optimal rule provided. Some scenario-based numerical experiments also carried out which reveal emphasize effect financial assumptions this research scheduling.